public class SearchInsertPosition {
    // 搜索插入位置 https://leetcode.cn/problems/search-insert-position/submissions/674991203/
    public int searchInsert(int[] nums, int target) {
        int left=0,right=nums.length-1;
        if(target>nums[right]) return right+1;
        while(left<right) {
            int mid=left+(right-left)/2;
            if(nums[mid]<target) {
                left=mid+1;
            } else {
                right=mid;
            }
        }
        return left;
    }
}
